Characterizing perfect recall using next-step temporal operators in S5 and sub-S5 Epistemic Temporal Logic

نویسنده

  • Andreas Witzel
چکیده

We review the notion of perfect recall in the literature on interpreted systems, game theory, and epistemic logic. In the context of Epistemic Temporal Logic (ETL), we give a (to our knowledge) novel frame condition for perfect recall, which is local and can straightforwardly be translated to a defining formula in a language that only has next-step temporal operators. This frame condition also gives rise to a complete axiomatization for S5 ETL frames with perfect recall. We then consider how to extend and consolidate the notion of perfect recall in sub-S5 settings, where the various notions discussed are no longer equivalent.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

What groups do, can do, and know they can do: an analysis in normal modal logics

We investigate a series of logics that allow to reason about agents’ actions, abilities, and their knowledge about actions and abilities. These logics include Pauly’s Coalition Logic CL, Alternating-time Temporal Logic ATL, the logic of ‘seeing-to-it-that’ (STIT), and epistemic extensions thereof. While complete axiomatizations of CL and ATL exist, only the fragment of the STIT language without...

متن کامل

Symbolic Model Checking Algorithms for Temporal-Epistemic Logic

The paper presents ordered binary decision diagram based symbolic model checking algorithms for fragments of a temporal-epistemic logic based on the temporal logic CTL∗ with operators for the knowledge and common knowledge of multiple agents. The knowledge operators are interpreted with respect to several distinct semantics: observational, clock, synchronous perfect recall and asynchronous perf...

متن کامل

Epistemic Actions and Ontic Actions: A Unified Logical Framework

We present a reasoning about actions framework based on a sum of epistemic logic S5 and propositional dynamic logic PDL together with a ‘no forgetting’ principle, also called perfect recall. We show that in our framework an action may be decomposed into a purely ontic action followed by a purely epistemic action. We also show that the latter is completely definable in terms of simple observatio...

متن کامل

Hypothesis Generation in Linear Temporal Logic for Clauses in a Restricted Syntactic Form

Possibility theory and modal logic are two knowledge representation frameworks that share some common features, such as the duality between possibility and necessity, as well as some obvious di↵erences since possibility theory is graded but is not primarily a logical setting. In the last thirty years there have been a series of attempts, reviewed in this paper, for bridging the two frameworks i...

متن کامل

Taming the Complexity of Temporal Epistemic Reasoning

Temporal logic of knowledge is a combination of temporal and epistemic logic that has been shown to be very useful in areas such as distributed systems, security, and multi-agent systems. However, the complexity of the logic can be prohibitive. We here develop a refined version of such a logic and associated tableau procedure with improved complexity but where important classes of specification...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2010